Ela Iterative Method for the Least Squares Problem of a Matrix Equation with Tridiagonal Matrix Constraint∗
نویسندگان
چکیده
The matrix-form LSQR method is presented in this paper for solving the least squares problem of the matrix equation AXB = C with tridiagonal matrix constraint. Based on a matrix-form bidiagonalization procedure, the least squares problem associated with the tridiagonal constrained matrix equation AXB = C reduces to a unconstrained least squares problem of linear system, which can be solved by using the classical LSQR algorithm. Furthermore, the preconditioned matrix-form LSQR method is adopted for solving the corresponding least squares problem.
منابع مشابه
Iterative method for the least squares problem of a matrix equation with tridiagonal matrix constraint
The matrix-form LSQR method is presented in this paper for solving the least squares problem of the matrix equation AXB = C with tridiagonal matrix constraint. Based on a matrix-form bidiagonalization procedure, the least squares problem associated with the tridiagonal constrained matrix equation AXB = C reduces to a unconstrained least squares problem of linear system, which can be solved by u...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملIterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملA New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation
In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...
متن کامل